Communication Processors

نویسندگان

  • Sridhar Rajagopal
  • Joseph R. Cavallaro
چکیده

Communication processors are processors with specific optimizations to support communication systems. Communication processors exist in a wide variety of forms and can be categorized based on the communication system, such as wired or wireless and based on the layer in the communication system, such as the physical layer, the medium access control layer or the network layer. Communication processors can be further categorized based on the application, such as audio, video or data and the end system requiring the communication system such as a laptop, a cell phone or a personal computer. As communication systems have evolved over the years, there has been an increase in data rates, increase in algorithm complexity, need for flexibility to adapt to different protocols and environments, need to optimize over varying constraints such as area, power, performance and the need for supporting multiple interfaces, devices and applications. In this chapter, we present a brief outline of the different types of communication processors and the need and requirements of each of these processors. We focus on the challenges in the physical layer design of communication processors with the evolution of communication systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Determining the Key Indicators affecting Electronic Customer Relationship Management (e-CRM) Using an integration of balanced scorecard and fuzzy screening techniques (Case Study: Companies Covered by Parsian Data-Processors Group)

Nowadays, increasing competition among companies and the huge cost of attracting new customers has led to companies seeking to retain existing customers rather than looking to attract new customers. These factors together have led to the emergence of customer relationship management. Thanks to the development of information and communication technology, especially the Internet, the use of custo...

متن کامل

5 Two basic models of distributed computation

Distributed computing and parallel computing study different kinds of systems, but they both study concurrent algorithms that run on collections of processors. In parallel computing, processors are tightly coupled, which usually means they move in lockstep, communication between processors is fast, and neither processors nor communication channels suffer from errors. By contrast, in a distribut...

متن کامل

Design and Experiment of a Communication-Aware Parallel Quicksort with Weighted Partition of Processors

In most parallel algorithms, inter-processor communication cost is much more than computing cost within a processor. So, it is very important to reduce the amount of inter-processor communication. This paper presents the design and experiment of a new communication-aware parallel quicksort scheme for distributed-memory multiprocessor systems. The key idea of the proposed scheme is the weighted ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005